Multiplicative Character Sums of Recurring Sequences with Rédei Functions
نویسندگان
چکیده
We prove a new bound for multiplicative character sums of nonlinear recurring sequences with Rédei functions over a finite field of prime order. This result is motivated by earlier results on nonlinear recurring sequences and their application to the distribution of powers and primitive elements. The new bound is much stronger than the bound known for general nonlinear recurring sequences.
منابع مشابه
Multiplicative Character Sums for Nonlinear Recurring Sequences with Dickson Polynomials
We give new bounds of character sums with sequences of iterations of Dickson polynomials over finite fields. This result is motivated by possible applications of nonlinear congruential pseudorandom number generators.
متن کاملExponential sums of nonlinear congruential pseudorandom number generators with Rédei functions
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. We give new bounds of exponential sums with sequences of iterations of Rédei functions over prime finite fields, which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators. © 2007 Elsevier Inc. All rights ...
متن کاملMultiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators.
متن کاملNew Pseudorandom Sequences Constructed by Quadratic Residues and Lehmer Numbers
Let p be an odd prime. Define en = { (−1), if n is a quadratic residue mod p, (−1)n+n+1, if n is a quadratic nonresidue mod p, where n is the multiplicative inverse of n modulo p such that 1 ≤ n ≤ p − 1. This paper shows that the sequence {en} is a “good” pseudorandom sequence, by using the properties of exponential sums, character sums, Kloosterman sums and mean value theorems of Dirichlet L-f...
متن کاملCharacter sums with Beatty sequences on Burgess-type intervals
We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence {⌊αn + β⌋ : n = 1, 2, . . . }, where α, β ∈ R, and α is irrational. Our bounds are nontrivial over the same short intervals for which the classical character sum estimates of Burgess have been established. 2000 Mathematics Subject Classification: 11B50, 11L40, 11T24
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008